Browsing by Subject "Distributed data structures"

Now showing items 1-3 of 3

    • Article  

      A combinatorial characterization of properties preserved by antitokens 

      Busch, Costas; Demetriou, Neophytos; Herlihy, M.; Mavronicolas, Marios (2000)
      Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distribution of the tokens on the network’s ...
    • Article  

      An efficient counting network 

      Busch, Costas; Mavronicolas, Marios (2010)
      We present a novel counting network construction, where the number of input wires w is smaller than or equal to the number of output wires t. The depth of our network is Θ(lg2w), which depends only on w. In contrast, the ...
    • Article  

      Supporting increment and decrement operations in balancing networks 

      Aiello, W.; Busch, Costas; Herlihy, M.; Mavronicolas, Marios; Shavit, N.; Touitou, D. (1999)
      Counting networks are a class of distributed data structures that support highly concurrent implementations of shared Fetch&Increment counters. Applications of these counters include shared pools and stacks, load balancing, ...